Recognizing Regular Expressions by Means of Dataflow Networks

نویسنده

  • Pascal Raymond
چکیده

This paper addresses the problem of building a Boolean dataflow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Regular Expressions by Means of Dataaow Networks

This paper addresses the problem of building a Boolean dataaow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression.

متن کامل

Recognizing Regular Expressions by Means of Dataaow Networks (extended Abstract)

This paper addresses the problem of building a Boolean dataaow network (sequential circuit) recognizing the language described by a regular expression. The main result is that both the construction time and the size of the resulting network are linear with respect to the size of the regular expression.

متن کامل

Dataflow Algebras as Formal Specifications of Data Flows

A framework is presented for constructing formal specifications of systems in a way that matches the use of Data Flow Diagrams to represent their structures, and which is therefore particularly applicable to parallel and distributed systems. The basis of this framework is that the behaviour of a system may be defined in terms of the possible patterns of data flows from one process to another vi...

متن کامل

Position Automata for Kleene Algebra with Tests

Kleene algebra with tests (KAT) is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allows for its application in compiler optimization, program transformation and dataflow analysis. To provide semantics for KAT expressions, Kozen first introduced automata on guarded strings, showing that the regular sets of ...

متن کامل

A meta-model for dataflow-based rules in smart environments: Evaluating user comprehension and performance

A considerable part of the behavior in smart environments relies on event-driven and rule specification. Rules are the mechanism most often used to enable user customization of the environment. However, the expressiveness of the rules available to users in editing and other tools is usually either limited or the available rule editing interfaces are not designed for end users with low skills in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996